Solving Nonlinear Single-Unit Commitment Problem by Genetic Algorithm Based Clustering Technique
نویسندگان
چکیده
منابع مشابه
Structured Genetic Algorithm Technique for Unit Commitment Problem
This paper presents and identifies alternative strategies with the advantages of Genetic Algorithm for solving the Thermal Unit Commitment (UC) problem. A Parallel Structure has been developed to handle the infeasibility problem in a structured and improved Genetic Algorithm (GA) which provides an effective search and therefore greater economy. In addition, this proposed method lead us to obtai...
متن کاملSolving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm
One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA). Simula...
متن کاملSolving Graph Coloring Problem by Fuzzy Clustering-Based Genetic Algorithm
The graph coloring problem is one of famous combinatoria1 optimization problerns. Some researchers attempted to solve combinatoria1 optimization problem with evolutionary a1gorithm, which can find near optima1 solution based on the evolution mechanism of the nature. However, it sometimes requires too much cost to eva1uate fitness of a large number of individuals in the population when applying ...
متن کاملSolving Unit Commitment Problem in Microgrids by Harmony Search Algorithm in Comparison with Genetic Algorithm and Improved Genetic Algorithm
This article presents a Harmony Search Algorithm to solve the unit commitment (UC) problem. A micro grid includes various types of smart distributed generators, renewable generators, storage devices and controllable load. A micro grid must satisfy its local needs and should be under the hierarchical control of management system. Due to this combination of conventional and renewable sources, the...
متن کاملGenetic Algorithm Based Tabu Search Method for Solving Unit Commitment Problem with Cooling –– Banking Constraints
This paper presents a new approach to solving the short-term unit commitment problem using the genetic algorithm based tabu search method with cooling and banking constraints. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Computer Engineering Research
سال: 2017
ISSN: 2412-4281,2410-9142
DOI: 10.18488/journal.76.2017.41.11.29